Errantum: Petersen graph has branchwidth 4
نویسنده
چکیده
In my doctoral thesis [1], I claimed a proof that the branchwidth of the Petersen graph had branchwidth 5 and proceeded to prove that it was a member of the obstruction set for graphs with branchwidth at most 4. I have stated this claim in Hicks [2] and Hicks et al. [4]. There was, however, an error in the construction of the tangle used to prove the claim. The branchwidth of the Petersen graph is 4. Figure 1 offers an optimal branch decomposition for the Petersen graph of width 4 that was computed using my tangle basis code [3] and the branchwidth of the Petersen graph is at least 4 since it contains K5 as minor [5].
منابع مشابه
Graphs with Branchwidth at Most Three
In this paper we investigate both the structure of graphs with branchwidth at most three, as well as algorithms to recognise such graphs. We show that a graph has branchwidth at most three, if and only if it has treewidth at most three and does not contain the three-dimensional binary cube graph as a minor. A set of four graphs is shown to be the obstruction set of graphs with branchwidth at mo...
متن کاملOn Self-Duality of Branchwidth in Graphs of Bounded Genus
A graph parameter is self-dual in some class of graphs embeddable in some surface if its value does not change in the dual graph more than a constant factor. Self-duality has been examined for several width-parameters, such as branchwidth, pathwidth, and treewidth. In this paper, we give a direct proof of the self-duality of branchwidth in graphs embedded in some surface. In this direction, we ...
متن کاملNew Tools and Results for Branchwidth
We provide new tools, such as k-troikas and good subtree-representations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G has branchwidth at most k if and only if it is a subgraph of a chordal graph in which every maximal clique has a k-troika respecting its minimal separators. Moreover, if G itself is chordal with clique tree T then such a chordal...
متن کاملSIGNED GENERALIZED PETERSEN GRAPH AND ITS CHARACTERISTIC POLYNOMIAL
Let G^s be a signed graph, where G = (V;E) is the underlying simple graph and s : E(G) to {+, -} is the sign function on E(G). In this paper, we obtain k-th signed spectral moment and k-th signed Laplacian spectral moment of Gs together with coefficients of their signed characteristic polynomial and signed Laplacian characteristic polynomial are calculated.
متن کاملBranchwidth of graphic matroids
Answering a question of Geelen, Gerards, Robertson and Whittle [2], we prove that the branchwidth of a bridgeless graph is equal to the branchwidth of its cycle matroid. Our proof is based on branch-decompositions
متن کامل